Analysing Humanly Generated Random Number Sequences: A Pattern-Based Approach
نویسندگان
چکیده
منابع مشابه
Analysing Humanly Generated Random Number Sequences: A Pattern-Based Approach
In a random number generation task, participants are asked to generate a random sequence of numbers, most typically the digits 1 to 9. Such number sequences are not mathematically random, and both extent and type of bias allow one to characterize the brain's "internal random number generator". We assume that certain patterns and their variations will frequently occur in humanly generated random...
متن کاملA theory-based approach to analysing conversation sequences.
AIMS To assess the quality of communication generally two procedures are used: one defines categories of utterances and counts their frequency, the other uses global observer ratings. We investigated whether a sequence analysis of utterances yields results which more precisely reflect the process of a conversation. METHODS We re-examined data from a randomised controlled intervention study in...
متن کاملPseudo-random Sequences Generated by Cellular Automata
Generation of pseudo random sequences by cellular automata, as well as by hybrid cellular automata is surveyed. An application to the fast evaluation and FPGA implementation of some classes of boolean functions is sketched out.
متن کاملMinkowski Functionals Study of Random Number Sequences
Random number sequences are used in a wide range of applications such as simulation, sampling, numerical analysis, cryptography, and recreation. The quality of random number sequences is critical to the correctness of these applications. Many statistical tests have been developed to test various characteristics of random number generators such as randomness, independence, uniformity, etc. Most ...
متن کاملRandom Fibonacci Sequences and the Number
For the familiar Fibonacci sequence (defined by f1 = f2 = 1, and fn = fn−1 + fn−2 for n > 2), fn increases exponentially with n at a rate given by the golden ratio (1 + √ 5)/2 = 1.61803398 . . . . But for a simple modification with both additions and subtractions — the random Fibonacci sequences defined by t1 = t2 = 1, and for n > 2, tn = ±tn−1 ± tn−2, where each ± sign is independent and eithe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLoS ONE
سال: 2012
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0041531